AN INTRINSICALLY NON MINIMAL-TIME MINSKY-LIKE 6-STATES SOLUTION TO THE FIRING SQUAD SYNCHRONIZATION PROBLEMYUNES, Jean-Baptiste.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 1, pp 55-68, issn 0988-3754, 14 p.Article

Similarity relations and cover automataCHAMPARNAUD, Jean-Marc; GUINGNE, Franck; HANSEL, Georges et al.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 1, pp 115-123, issn 0988-3754, 9 p.Article

COMMUNICATION-OPTIMAL PARALLEL AND SEQUENTIAL CHOLESKY DECOMPOSITIONBALLARD, Grey; DEMMEL, James; HOLTZ, Olga et al.SIAM journal on scientific computing (Print). 2011, Vol 32, Num 6, pp 3495-3523, issn 1064-8275, 29 p.Article

A parallel algorithm for generating bicompatible elimination orderings of proper interval graphsPANDA, B. S; DAS, Sajal K.Information processing letters. 2009, Vol 109, Num 18, pp 1041-1046, issn 0020-0190, 6 p.Article

Robust random number generation for peer-to-peer systemsAWERBUCH, Baruch; SCHEIDELER, Christian.Theoretical computer science. 2009, Vol 410, Num 6-7, pp 453-466, issn 0304-3975, 14 p.Article

Minimal non-deletable sets and minimal non-codeletable sets in binary imagesYUNG KONG, T.Theoretical computer science. 2008, Vol 406, Num 1-2, pp 97-118, issn 0304-3975, 22 p.Article

BLOCK AND PARALLEL VERSIONS OF ONE-SIDED BIDIAGONALIZATIONBOSNER, Nela; BARLOW, Jesse L.SIAM journal on matrix analysis and applications. 2007, Vol 29, Num 3, pp 927-953, issn 0895-4798, 27 p.Article

PARALLEL BIDIAGONALIZATION OF A DENSE MATRIXCAMPOS, Carlos; GUERRERO, David; HERNANDEZ, Vicente et al.SIAM journal on matrix analysis and applications. 2007, Vol 29, Num 3, pp 826-837, issn 0895-4798, 12 p.Article

On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphsKHACHIYAN, Leonid; BOROS, Endre; ELBASSIONI, Khaled et al.Theoretical computer science. 2007, Vol 382, Num 2, pp 139-150, issn 0304-3975, 12 p.Conference Paper

Finding large independent sets in graphs and hypergraphsSHACHNAI, Hadas; SRINIVASAN, Aravind.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 3, pp 488-500, issn 0895-4801, 13 p.Article

A parallel eigensolver for dense symmetric matrices based on multiple relatively robust representationsBIENTINESI, Paolo; DHILLON, Inderjit S; VAN DE GEIJN, Robert A et al.SIAM journal on scientific computing (Print). 2005, Vol 27, Num 1, pp 43-66, issn 1064-8275, 24 p.Article

An event-driven optimization framework for dynamic vehicle routingPILLAC, Victor; GUERET, Christelle; MEDAGLIA, Andrés L et al.Decision support systems. 2012, Vol 54, Num 1, pp 414-423, issn 0167-9236, 10 p.Article

Best semi-online algorithms for unbounded parallel batch schedulingJINJIANG YUAN; NG, C. T; CHENG, T. C. E et al.Discrete applied mathematics. 2011, Vol 159, Num 8, pp 838-847, issn 0166-218X, 10 p.Article

Parallel randomized load balancing: A lower bound for a more general modelEVEN, Guy; MEDINA, Moti.Theoretical computer science. 2011, Vol 412, Num 22, pp 2398-2408, issn 0304-3975, 11 p.Article

p4est: SCALABLE ALGORITHMS FOR PARALLEL ADAPTIVE MESH REFINEMENT ON FORESTS OF OCTREESBURSTEDDE, Carsten; WILCOX, Lucas C; GHATTAS, Omar et al.SIAM journal on scientific computing (Print). 2011, Vol 33, Num 3-4, pp 1103-1133, issn 1064-8275, 31 p.Article

Improved online algorithms for parallel job scheduling and strip packingHURINK, J. L; PAULUS, J. J.Theoretical computer science. 2011, Vol 412, Num 7, pp 583-593, issn 0304-3975, 11 p.Article

On the complexity of sandpile critical avalanchesMEJIA, Carolina; MONTOYA, J. Andres.Theoretical computer science. 2011, Vol 412, Num 30, pp 3964-3974, issn 0304-3975, 11 p.Article

Aligning the representation and reality of computation with asynchronous logic automataGERSHENFELD, Neil.Computing (Wien. Print). 2011, Vol 93, Num 2-4, pp 91-102, issn 0010-485X, 12 p.Article

A randomized sublinear time parallel GCD algorithm for the EREW PRAMSORENSON, Jonathan P.Information processing letters. 2010, Vol 110, Num 5, pp 198-201, issn 0020-0190, 4 p.Article

Embedding of tori and grids into twisted cubesLAI, Pao-Lien; TSAI, Chang-Hsiung.Theoretical computer science. 2010, Vol 411, Num 40-42, pp 3763-3773, issn 0304-3975, 11 p.Article

A fast parallel algorithm for finding Hamiltonian cycles in dense graphsSARKÖZY, Gabor N.Discrete mathematics. 2009, Vol 309, Num 6, pp 1611-1622, issn 0012-365X, 12 p.Article

Fast arithmetics using Chinese remainderingDAVIDA, George; LITOW, Bruce; GUANGWU XU et al.Information processing letters. 2009, Vol 109, Num 13, pp 660-662, issn 0020-0190, 3 p.Article

Upper bounds and algorithms for parallel knock-out numbersBROERSMA, Hajo; JOHNSON, Matthew; PAULUSMA, Daniël et al.Theoretical computer science. 2009, Vol 410, Num 14, pp 1319-1327, issn 0304-3975, 9 p.Article

Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matchingHYYRÖ, Heikki.Information processing letters. 2008, Vol 108, Num 5, pp 313-319, issn 0020-0190, 7 p.Article

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCHCACERES, E. N; SONG, S. W; SZWARCFITER, J. L et al.Informatique théorique et applications (Imprimé). 2010, Vol 44, Num 3, pp 293-311, issn 0988-3754, 19 p.Article